#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int a, b, c;

inline void solution() {
    int a1, a2, b1, b2, c1, c2;
    scanf("%d.%d.%d %d.%d.%d", &a1, &b1, &c1, &a2, &b2, &c2);
    c = (c1 + c2) % 29;
    int e = (c1 + c2) / 29;
    b = (b1 + b2 + e) % 17;
    e = (b1 + b2 + e) / 17;
    a = a1 + a2 + e;
    printf("%d.%d.%d\n", a, b, c);
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}